Random and exhaustive generation of permutations and cycles
نویسنده
چکیده
In 1986 S. Sattolo introduced a simple algorithm for uniform random generation of cyclic permutations on a fixed number of symbols. This algorithm is very similar to the standard method for generating a random permutation, but is less well known. We consider both methods in a unified way, and discuss their relation with exhaustive generation methods. We analyse several random variables associated with the algorithms and find their grand probability generating functions, which gives easy access to moments and limit laws.
منابع مشابه
Preserving the Number of Cycles of Length k in a Growing Uniform Permutation
The goal of this work is to describe a uniform generation tree for permutations which preserves the number of k-cycles between any permutation (except for a small unavoidable subset of optimal size) of the tree and its direct children. Moreover, the tree we describe has the property that if the number of k-cycles does not change during any k consecutive levels, then any further random descent w...
متن کاملFast Generation of Deviates for Order Statistics by an Exact Method
We propose an exact method for generating random deviates from continuous order statistics. This versatile method that generates Beta deviates as a middle step can be applied to any density function without resorting to numerical inversion. We also conduct an exhaustive investigation to document the merits of our method in generating deviates from any Beta distribution.
متن کاملCycles of Random Permutations with Restricted Cycle Lengths
We prove some general results about the asymptotics of the distribution of the number of cycles of given length of a random permutation whose distribution is invariant under conjugation. These results were first established to be applied in a forthcoming paper [BG], where we prove results about cycles of random permutations which can be written as free words in several independent random permut...
متن کاملSpatial Random Permutations and Infinite Cycles
We consider systems of spatial random permutations, where permutations are weighed according to the point locations. Infinite cycles are present at high densities. The critical density is given by an exact expression. We discuss the relation between the model of spatial permutations and the ideal and interacting quantum Bose gas.
متن کاملProbability Generating Functions for Sattolo’s Algorithm
In 1986 S. Sattolo introduced a simple algorithm for uniform random generation of cyclic permutations on a fixed number of symbols. Recently, H. Prodinger analysed two important random variables associated with the algorithm, and found their mean and variance. H. Mahmoud extended Prodinger’s analysis by finding limit laws for the same two random variables.The present article, starting from the ...
متن کامل